Ordering relations admitting automorphisms

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Automorphisms of finite p-groups admitting a partition

For a finite p-group P the following three conditions are equivalent: (a) to have a (proper) partition, that is, to be the union of some proper subgroups with trivial pairwise intersections; (b) to have a proper subgroup outside of which all elements have order p; (c) to be a semidirect product P = P1o ⟨φ⟩ where P1 is a subgroup of index p and φ is a splitting automorphism of order p of P1. It ...

متن کامل

Automorphisms and strongly invariant relations

We investigate characterizations of the Galois connection sInv–Aut between sets of finitary relations on a base set A and their automorphisms. In particular, for A = ω1, we construct a set R of relations that is closed under all invariant operations on relations and under arbitrary intersections, but is not closed under sInv Aut.

متن کامل

Isomorphism of Quadratic Norm and Pc Ordering of Estimators Admitting

BAN estimators generally admit first order representations which insure them to be also asymptotically Pitman closest. For AN estimators admitting a first order representation, an ordering under the Pitman closeness measure is established and is shown to be isomorphic to the one under 'the usual quadratic norm. Multiparameter problems are also treated in the same vein.

متن کامل

Ordering Constraints on Discourse Relations

Recent work investigates the ordering constraints discourse relations impose on texts. Wolf and Gibson (2003) generated GraphBank, a discourse-annotated corpus without a prior constraint to tree-structured annotations, showing that naive annotators generate representations containing multiple-parented nodes and relations with crossing arguments. Webber et al. (2003) hypothesize that discourse m...

متن کامل

Deriving Laws from Ordering Relations

The effect of Richard T. Cox’s contribution to probability theory was to generalize Boolean implication among logical statements to degrees of implication, which are manipulated using rules derived from consistency with Boolean algebra. These rules are known as the sum rule, the product rule and Bayes’ Theorem, and the measure resulting from this generalization is probability. In this paper, I ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Fundamenta Mathematicae

سال: 1964

ISSN: 0016-2736,1730-6329

DOI: 10.4064/fm-54-3-279-284